Finitary bases and formal generating functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finitary bases and formal generating functions

Let k be a nonzero, commutative ring with 1, and let R be a k-algebra with a countably-infinite ordered free k-basis B = {pn: n~>0}. We characterize and analyze those bases from which one can construct a k-algebra of 'formal B-series' of the form f = ~ c , p , , with cn Ek, showing inter alia that many classical polynomial bases fail to have this property. @ 1998 Elsevier Science B.V. All right...

متن کامل

Finitary formal topologies and Stone's representation theorem

We study the concept of finitary formal topology, a point-free version of a topological space with a basis of compact open subsets. The notion of finitary formal topology is defined from the perspective of the Basic Picture (introduced by the second author) and thus it is endowed with a binary positivity relation. As an application, we prove a constructive version of Stone’s representation theo...

متن کامل

Finitary Galois Extensions over Noncommutative Bases

We study Galois extensions M (co-)H ⊂ M for H-(co)module algebras M if H is a Frobenius Hopf algebroid. The relation between the action and coaction pictures is analogous to that found in Hopf-Galois theory for finite dimensional Hopf algebras over fields. So we obtain generalizations of various classical theorems of Kreimer-Takeuchi, Doi-Takeuchi and Cohen-FischmanMontgomery. We find that the ...

متن کامل

On composition of generating functions

In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...

متن کامل

Generating Indexed Formal Software Documents Generating Indexed Formal Software Documents

Precise software documentation can be written as a set of mathematical expressions, but in practice, people require a mixture of informal (English) material and formal mathematical expressions. Furthermore, most documents for real software comprise hundreds of tables. Appropriate indices are required to e ciently search for information. In this work we consider the problem of automatic preparat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1998

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(98)00044-2